(±¸)Á¤º¸°úÇÐȸ ³í¹®Áö
Current Result Document :
ÇѱÛÁ¦¸ñ(Korean Title) |
Á¤º¸ÀÌ·ÐÀ» ÀÌ¿ëÇÑ º´Çà ÇÁ·Î±×·¥ÀÇ º¹Àâµµ ôµµ |
¿µ¹®Á¦¸ñ(English Title) |
Complexity Metrics for Concurrent Programs Based on Information Theory |
ÀúÀÚ(Author) |
Â÷½Å
Á¤Àλó
±Ç¿ë·¡
Shin Cha
In Sang Chung
Yong Rae Kwon
|
¿ø¹®¼ö·Ïó(Citation) |
VOL 20 NO. 08 PP. 1191 ~ 1202 (1993. 08) |
Çѱ۳»¿ë (Korean Abstract) |
¼øÂ÷Àû ÇÁ·Î±×·¥ÀÇ º¹Àâµµ¸¦ ÃøÁ¤Çϱâ À§ÇÑ ¸¹Àº ¿¬±¸¿¡µµ ºÒ±¸ÇÏ°í º´Çà±×·¥ÀÇ º¹Àâµµ ôµµ¿¡ °üÇÑ ¿¬±¸´Â ¹Ì¹ÌÇÑ ÆíÀÌ´Ù. º» ³í¹®¿¡¼´Â º´Çà ÇÁ·Î±×·¥ÀÇ º¹Àâµµ¸¦ ÃøÁ¤Çϱâ À§ÇÏ¿© Á¤º¸À̷п¡ ±Ù°Å¸¦ µÐ »õ·Î¿î º¹Àâµµ ôµµ¸¦ Á¦¾ÈÇÑ´Ù. Á¦¾ÈµÈ º¹Àâµµ ôµµ´Â º´Çà ÇÁ·Î±×·¥À» º¹ÀâÇÏ°Ô ¸¸´Ù´Â ¿äÀÎÀ¸·Î ÀνĵǴ Á¤º¸·®, ºñ°áÁ¤¼º ¹× µ¿±âȷκÎÅÍ ±âÀÎÇÏ´Â º¹Àâµµ¸¦ ÃøÁ¤ÇÑ´Ù. Á¦¾ÈµÈ º¹Àâµµ ôµµ¸¦ ±¸Çϱâ À§ÇÏ¿© º´Çà ÇÁ·Î±×·¥ÀÇ Ç¥Çö ¹æ¹ýÀ¸·Î º´Çà ÇÁ·Î±×·¥ÀÇ Á¤Àû ºÐ¼®¿¡ ÀÌ¿ëµÇ´Â º´Çà ±×·¡ÇÁ¸¦ »ç¿ëÇÑ´Ù. Á¦¾ÈµÈ ¹æ¹ýÀ» ´ëÇ¥ÀûÀÎ º´Çà ÇÁ·Î±×·¥ ¾ð¾îÀÎ Ada¿¡ Àû¿ëÇÏ¿© ±× À¯¿ë¼ºÀ» º¸¿©ÁØ´Ù. |
¿µ¹®³»¿ë (English Abstract) |
Despite various researches for measuring the complexity of sequential programs, few attempts have been made to measure the complexity of concurrent programs. In this paper, we present new complexity metrics based on information theory which can measure the complexity of concurrent programs. Proposed metries measure primary factors influencing concurrent program's complexity such as information content, nondeterminism and intertasking. In order to compute the complexity, we use the concurrency graph previously developed for static analysis of concurrent programs. Using Ada as a model language, we show how to define proposed metrics and illustrate the implications with examples. |
Å°¿öµå(Keyword) |
|
ÆÄÀÏ÷ºÎ |
PDF ´Ù¿î·Îµå
|